The implicit function theorem and free algebraic sets
نویسندگان
چکیده
We prove an implicit function theorem for non-commutative functions. We use this to show that if p(X, Y ) is a generic non-commuting polynomial in two variables, and X is a generic matrix, then all solutions Y of p(X, Y ) = 0 will commute with X.
منابع مشابه
Implicit function theorem over free groups
We introduce the notion of a regular quadratic equation and a regular NTQ system over a free group. We prove the results that can be described as Implicit function theorems for algebraic varieties corresponding to regular quadratic and NTQ systems. We will also show that the Implicit function theorem is true only for these varieties. In algebraic geometry such results would be described as lift...
متن کاملA projection-based formulation of the Implicit Function Theorem and its application to time-varying manifolds
In this paper, we derive a projection-based formulation of the Implicit Function Theorem. We give conditions, when an algebraic, time-parameterized equation G(t, x) = 0 is solvable for components P x that are selected by a projection P c and we derive an implicit function gP that specializes P x in terms of the complementary components Px, where P = In−P . We apply this result to construct a pr...
متن کاملFunctionally closed sets and functionally convex sets in real Banach spaces
Let $X$ be a real normed space, then $C(subseteq X)$ is functionally convex (briefly, $F$-convex), if $T(C)subseteq Bbb R $ is convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$ is functionally closed (briefly, $F$-closed), if $T(K)subseteq Bbb R $ is closed for all bounded linear transformations $Tin B(X,R)$. We improve the Krein-Milman theorem ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA common fixed point theorem for weakly compatible maps satisfying common property (E:A:) and implicit relation in intuitionistic fuzzy metric spaces
In this paper, employing the common property ($E.A$), we prove a common fixed theorem for weakly compatible mappings via an implicit relation in Intuitionistic fuzzy metric space. Our results generalize the results of S. Kumar [S. Kumar, {it Common fixed point theorems in Intuitionistic fuzzy metric spaces using property (E.A)}, J. Indian Math. Soc., 76 (1-4) (2009), 94--103] and C. Alaca et al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016